Graphs with extremal incidence energy
نویسندگان
چکیده
منابع مشابه
randic incidence energy of graphs
let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and edge set $e(g) = {e_1, e_2,ldots , e_m}$. similar tothe randi'c matrix, here we introduce the randi'c incidence matrixof a graph $g$, denoted by $i_r(g)$, which is defined as the$ntimes m$ matrix whose $(i, j)$-entry is $(d_i)^{-frac{1}{2}}$ if$v_i$ is incident to $e_j$ and $0$ otherwise. naturally, therandi'c incidenc...
متن کاملEccentric Connectivity Index: Extremal Graphs and Values
Eccentric connectivity index has been found to have a low degeneracy and hence a significant potential of predicting biological activity of certain classes of chemical compounds. We present here explicit formulas for eccentric connectivity index of various families of graphs. We also show that the eccentric connectivity index grows at most polynomially with the number of vertices and determine ...
متن کاملRandić Incidence Energy of Graphs
Let G be a simple graph with vertex set V (G) = {v1, v2, . . . , vn} and edge set E(G) = {e1, e2, . . . , em}. Similar to the Randić matrix, here we introduce the Randić incidence matrix of a graph G, denoted by IR(G), which is defined as the n × m matrix whose (i, j)-entry is (di) 1 2 if vi is incident to ej and 0 otherwise. Naturally, the Randić incidence energy IRE of G is the sum of the sin...
متن کاملGraphs with Extremal Connectivity Index
Let G be a graph and δv the degree of its vertex v . The connectivity index of G is χ = ∑ (δu δv) −1/2 , with the summation ranging over all pairs of adjacent vertices of G . We offer a simple proof that (a) among n-vertex graphs without isolated vertices, the star has minimal χvalue, and (b) among n-vertex graphs, the graphs in which all components are regular of non–zero degree have maximal (...
متن کاملExtremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
The main result of this paper is that for a special, but rather wide class of "sample graphs", the extremal graphs, i.e, the graphs of n vertices without subgraphs isomorphic to the sample graph and having maximum number of edges under this condition, have very simple and sYmmetric structure. This result remains valid even in the case when the' condition "the graph does not contain the sample g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2015
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1506251z